On Strict Pseudoconvexity
نویسنده
چکیده
The present paper provides first and second-order characterizations of a radially lower semicontinuous strictly pseudoconvex function f : X → R defined on a convex setX in the real Euclidean space Rn in terms of the lower Dini-directional derivative. In particular we obtain connections between the strictly pseudoconvex functions, nonlinear programming problem, Stampacchia variational inequality, and strict Minty variational inequality. We extend to the radially continuous functions the characterization due to Diewert, Avriel, Zang [6]. A new implication appears in our conditions. Connections with other classes of functions are also derived.
منابع مشابه
NP-hardness of Deciding Convexity of Quartic Polynomials and Related Problems
We show that unless P=NP, there exists no polynomial time (or even pseudo-polynomial time) algorithm that can decide whether a multivariate polynomial of degree four (or higher even degree) is globally convex. This solves a problem that has been open since 1992 when N. Z. Shor asked for the complexity of deciding convexity for quartic polynomials. We also prove that deciding strict convexity, s...
متن کاملPseudoconvexity, Analytic Discs, and Invariant Metrics
We begin by studying characterizations of pseudoconvexity, and also of finite type, using analytic discs. The results presented are analogous to well-known ideas from the real variable setting in which “pseudoconvex” is replaced by “convex” and “analytic disc” is replaced by “line segment”. The second part of the paper concerns regularity results for the Kobayashi metric. Of course this metric ...
متن کاملSecond Order Strong F-Pseudoconvexity in a Class of Non-Differentiable Scalar Nonlinear Programming Problems
A new class of functions namely, second order strongly F-pseudoconvex functions is introduced which is a generalization of both strongly pseudoconvex functions and strongly pseudoinvex functions. Second order optimality conditions and second order duality results for a class of nonlinear non-differentiable scalar programming problems with a square root term in the objective function as well as ...
متن کاملAlgebraic relaxations and hardness results in polynomial optimization and Lyapunov analysis
The contributions of the first half of this thesis are on the computational and algebraic aspects of convexity in polynomial optimization. We show that unless P=NP, there exists no polynomial time (or even pseudo-polynomial time) algorithm that can decide whether a multivariate polynomial of degree four (or higher even degree) is globally convex. This solves a problem that has been open since 1...
متن کاملPseudoconvexity Is a Two-dimensional Phenomenon
An open set in Cn is pseudoconvex if and only if its intersection with every affine subspace of complex dimension two as seen as an open set in C is pseudoconvex.
متن کامل